<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    523. Continuous Subarray Sum
   </h1>
   <p>
    Given a list of
    <b>
     non-negative
    </b>
    numbers and a target
    <b>
     integer
    </b>
    k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multiple of
    <b>
     k
    </b>
    , that is, sums up to n*k where n is also an
    <b>
     integer
    </b>
    .
   </p>
   <p>
    &nbsp;
   </p>
   <p>
    <b>
     Example 1:
    </b>
   </p>
   <pre>
<b>Input:</b> [23, 2, 4, 6, 7],  k=6
<b>Output:</b> True
<b>Explanation:</b> Because [2, 4] is a continuous subarray of size 2 and sums up to 6.
</pre>
   <p>
    <b>
     Example 2:
    </b>
   </p>
   <pre>
<b>Input:</b> [23, 2, 6, 4, 7],  k=6
<b>Output:</b> True
<b>Explanation:</b> Because [23, 2, 6, 4, 7] is an continuous subarray of size 5 and sums up to 42.
</pre>
   <p>
    &nbsp;
   </p>
   <p>
    <b>
     Note:
    </b>
   </p>
   <ol>
    <li>
     The length of the array won't exceed 10,000.
    </li>
    <li>
     You may assume the sum of all the numbers is in the range of a signed 32-bit integer.
    </li>
   </ol>
  </div>
  <div>
   <h1 class="question_title">
    523. 连续的子数组和
   </h1>
   <p>
    给定一个包含
    <strong>
     非负数
    </strong>
    的数组和一个目标
    <strong>
     整数
    </strong>
    &nbsp;k，编写一个函数来判断该数组是否含有连续的子数组，其大小至少为 2，总和为
    <strong>
     k
    </strong>
    的倍数，即总和为 n*k，其中 n 也是一个
    <strong>
     整数
    </strong>
    。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre><strong>输入:</strong> [23,2,4,6,7], k = 6
<strong>输出:</strong> True
<strong>解释:</strong> [2,4] 是一个大小为 2 的子数组，并且和为 6。
</pre>
   <p>
    <strong>
     示例 2:
    </strong>
   </p>
   <pre><strong>输入:</strong> [23,2,6,4,7], k = 6
<strong>输出:</strong> True
<strong>解释:</strong> [23,2,6,4,7]是大小为 5 的子数组，并且和为 42。
</pre>
   <p>
    <strong>
     说明:
    </strong>
   </p>
   <ol>
    <li>
     数组的长度不会超过10,000。
    </li>
    <li>
     你可以认为所有数字总和在 32 位有符号整数范围内。
    </li>
   </ol>
  </div>
 </body>
</html>